A Generational Scheme for Partitioning Graphs
نویسندگان
چکیده
Graph partitioning divides a graph into several pieces by cutting edges. Very effective heuristic partitioning algorithms have been developed which run in real-time, but it is unknown how good the partitions are since the problem is, in general, NP-complete. This paper reports an evolutionary search algorithm for finding benchmark partitions. Distinctive features are the transmission and modification of whole subdomains (the partitioned units) that act as genes, and the use of a multilevel heuristic algorithm to effect the crossover and mutations. Its effectiveness is demonstrated by improvements on previously established benchmarks.
منابع مشابه
Design and Evaluation of a Method for Partitioning and Offloading Web-based Applications in Mobile Systems with Bandwidth Constraints
Computation offloading is known to be among the effective solutions of running heavy applications on smart mobile devices. However, irregular changes of a mobile data rate have direct impacts on code partitioning when offloading is in progress. It is believed that once a rate-adaptive partitioning performed, the replication of such substantial processes due to bandwidth fluctuation can be avoid...
متن کاملQuerying Distributed RDF Graphs: The Effects of Partitioning
Web-scale RDF datasets are increasingly processed using distributed RDF data stores built on top of a cluster of shared-nothing servers. Such systems critically rely on their data partitioning scheme and query answering scheme, the goal of which is to facilitate correct and efficient query processing. Existing data partitioning schemes are commonly based on hashing or graph partitioning techniq...
متن کاملA Clique Tree Algorithm for Partitioning a Chordal Graph into Transitive Subgraphs
A partitioning problem on chordal graphs that arises in the solution of sparse triangular systems of equations on parallel computers is considered Roughly the problem is to partition a chordal graph G into the fewest transitively orientable subgraphs over all perfect elimination orderings of G subject to a certain precedence relationship on its vertices In earlier work a greedy scheme that solv...
متن کاملWavefront Diiusion and Lmsr: Algorithms for Dynamic Repartitioning of Adaptive Meshes
Existing state-of-the-art schemes for dynamic repartitioning of adaptive meshes can be classiied as either diiusion-based schemes or scratch-remap schemes. We present a new scratch-remap scheme called Locally-Matched Multilevel Scratch-Remap (or simply LMSR). The LMSR scheme tries to compute a partitioning that has a high overlap with the existing partitioning. We show that LMSR decreases the a...
متن کاملVertex Ordering, Clustering, and Their Application to Graph Partitioning
We propose a new heuristic for vertex ordering and a method that splits the vertex ordering into clusters. We apply them to the graph partitioning problem. The application of these ideas incorporates reordering in genetic algorithms and the identification of clustered structures in graphs. Experimental tests on benchmark graphs showed that the new vertex-ordering scheme performed better than ex...
متن کامل